Infinite servers queue systems busy period - a practical case on logistics problems solving
نویسندگان
چکیده
منابع مشابه
Error Analysis of the Mean Busy Period of a Queue
The error between the actual value of the mean busy periQ..d and the value estimaled by a common queueing tormula (D;:;: SOl (i-V)) is evaluated. tDenning's addre:'l!l: Department of Compu.ter Sciences, Purdue University, W. Lafayette, IN 41907 USA. KoweJk's addre:iS: FClchbcrcich Inrormatik, Univer:ritut Hamburg. RoUlerbllumschau9ce 07/09, 2000 Hamburg 10, West Gcrmuny.
متن کاملOperating Systems Support for Busy Internet Servers
The Internet has experienced exponential growth in the use of the World-Wide Web, and rapid growth in the use of other Internet services such as VSENET news and electronic mail. These applications qualitatively differ from other network applications in the stresses they impose on busy server systems. Unlike traditional distributed systems, Internet servers must cope with huge user communities, ...
متن کاملA Poisson limit for the departure process from a queue with many busy servers
We establish a limit theorem supporting a Poisson approximation for the departure process from a multi-server queue that tends to have many busy servers. This limit can support approximating a flow out of such a queue in a complex queueing network by an independent Poisson source. The main ideas are: (i) to scale time so that previous many-server heavy-traffic limits can be applied and (ii) for...
متن کاملOn the Existence of Moments for the Busy Period in a Single-Server Queue
We obtain sufficient conditions for the finiteness of the moments of the single-server queue busy period in discrete and continuous time. In the cases of power and exponential moments, the conditions found coincide with the known necessary ones. 1. Introduction and notation. Consider a sequence t n n of random vectors with nonnegative coordinates which are i.i.d. in n, but any dependence betwee...
متن کاملTransient queue length and busy period of the BMAP / PH / 1 queue
We derive in this paper the transient queue length and the busy period distributions in the single server queue with phase-type (PH) services times and a batch Markovian arrival process (BMAP). These distributions are obtained by the uniformization technique which gives simple recurrence relations. The main advantage of this technique is that it leads to stable algorithms for which the precisio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Sciences
سال: 2015
ISSN: 1314-7552
DOI: 10.12988/ams.2015.410808